A memetic algorithm for multi-objective dynamic location problems
نویسندگان
چکیده
منابع مشابه
A memetic algorithm for multi-objective dynamic location problems
This paper describes a new multiobjective interactive memetic algorithm applied to dynamic location problems. The memetic algorithm integrates genetic procedures and local search. It is able to solve capacitated and uncapacitated multi-objective single or multi-level dynamic location problems. These problems are characterized by explicitly considering the possibility of a facility being open, c...
متن کاملA multi-objective memetic algorithm for risk minimizing vehicle routing problem and scheduling problem
In this paper, a new approach to risk minimizing vehicle routing and scheduling problem is presented. Forwarding agents or companies have two main concerns for the collection of high-risk commodities like cash or valuable commodities between the central depot and the customers: one; because of the high value of the commodities transported, the risk of ambush and robbery are very high. Two; the ...
متن کاملA memetic algorithm for a multi-objective obnoxious waste location-routing problem: a case study
This paper proposes a model for obnoxious waste location-routing problem (LRP) considering various types of wastes and several treatment technologies. The investigated distribution network includes three echelons of generation nodes, treatment and disposal facilities. A multi-objective LRP model is developed with three objective functions minimizing the treatment and disposal facility undesirab...
متن کاملMemetic Algorithm for Dynamic Optimization Problems
Dynamic optimization problems has attracted much attention of researchers. However, due to complexity and uncertainty to solve dynamic optimization problems, it very difficult to find out the optimum solution that could be changed over time. Thus, it is necessary to develop efficient or improved an algorithms to solve dynamic optimization problems. A memetic algorithm that based on local search...
متن کاملA Multi-objective Imperialist Competitive Algorithm for a Capacitated Single-allocation Hub Location Problem
In this paper, we present a novel multi-objective mathematical model for capacitated single allocation hub location problem. There are the vehicle capacity constraint and capacity restrictions amount of the incoming flow to the hub while the balancing requirements of incoming quantities of flow to the each hub is considered. Moreover, there is a set of available capacities for each potential hu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Global Optimization
سال: 2007
ISSN: 0925-5001,1573-2916
DOI: 10.1007/s10898-007-9239-9